Parallel Processing for Large-scale Fault Tree in Wireless Sensor Networks

Wireless sensor networks (WSN) covers many kinds of technologies, such as technology of sensor, embedded system, wireless communication, etc. WSN is different from the traditional networks in size, communication distance and energy-constrained so as to develop new topology, protocol, quality of service (QoS), and so on. In order to solve the problem of self-organizing in the topology, this paper proposes a novel strategy which is based on communication delay between sensors. Firstly, the gateway selects some boundary nodes to connect. Secondly, the boundary nodes choose inner nodes. The rest may be deduced by analogy. Finally, a net-tree topology with multipath routing is developed. The analyses of the topology show that net-tree has strong ability in self-organizing and extensible. However, the scale of system is usually very large and complexity so that it is hard to detect the failure nodes when the nodes fail. To solve the greater challenge, the paper proposes to adopt fault tree analysis. Fault tree is a commonly used method to analyze the reliability of a network or system. Based on the fault tree analysis, a parallel computing algorithm is represented to these faults in the net-tree. Firstly, two models for parallel processing are came up and we focus on the parallel processing algorithm based on the cut sets. Then, the speedup ratio is studied. Compare with the serial algorithm, the results of the experiment shows that the efficiency has been greatly improved.